scholar.google.com › citations
Jul 8, 2017 · A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex v and a label \lambda, returns a (1+\varepsilon)- ...
Sep 11, 2019 · In this paper we present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times.
Dec 12, 2017 · We consider distance queries in vertex-labeled planar graphs. For any fixed 0 < 𝜖 ≤ 1/2 we show how to preprocess a directed planar graph ...
Missing: Approximate | Show results with:Approximate
Efficient Dynamic Approximate. Distance Oracles for Vertex-. Labeled Planar Graphs. Submitted by Itay Laish. Under the supervision of Dr. Shay Mozes. M.Sc ...
Apr 18, 2015 · Given a vertex u and a label \lambda return a (1+\epsilon)-approximation of the distance from u to its closest vertex with label \lambda.
Abstract We consider distance queries in vertex-labeled planar graphs. For any fixed 0 < ≤ 1/2 we show how to preprocess a directed planar graph with.
A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex $v$ and a label $\lambda$, returns a $(1+\varepsilon)$-approximation of ...
Efficient Vertex-Label Distance Oracles for Planar Graphs. The- ory of Computing Systems, 62(2):419–440, February 2018. doi:10.1007/s00224-017-9827-0. 14.
For general graphs, no efficient (2)-stretch approximate vertex-vertex distance oracles are known to date. For any integer k ≥ 2, Thorup and Zwick [TZ05] ...
This paper presents three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, ...